Generalized Algorithm for Restricted Weak Composition Generation - Generation Algorithm for Second-Order Restricted Weak Compositions
نویسنده
چکیده
This paper presents a new algorithm that arrives at a generalized solution for the generation of restricted weak compositions of n-parts. In particular, this generalized algorithm covers many commonly sought compositions such as bounded compositions, restricted compositions, weak compositions, and restricted part compositions. Introduced is an algorithm for generating generalized types of restricted weak compositions called first-order, and secondorder restricted weak compositions.
منابع مشابه
Parallel Algorithm for Second-Order Restricted Weak Integer Composition Generation for Shared Memory Machines
In 2012, Page presented a sequential combinatorial generation algorithm for generalized types of restricted weak integer compositions called second–order restricted weak integer compositions. Second–order restricted weak integer compositions cover various types of restricted weak integer compositions of n parts such as integer compositions, bounded compositions, and part–wise integer compositio...
متن کاملCorrections to the results derived in "A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions"'; and a comparison of four restricted integer composition generation algorithms
In this note, I discuss results on integer compositions/partitions given in the paper “A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions”. I also experiment with four different generation algorithms for restricted integer compositions and find the algorithm designed in the named paper to be pretty slow, comparatively. Some of my ...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملHyperstability of some functional equation on restricted domain: direct and fixed point methods
The study of stability problems of functional equations was motivated by a question of S.M. Ulam asked in 1940. The first result giving answer to this question is due to D.H. Hyers. Subsequently, his result was extended and generalized in several ways.We prove some hyperstability results for the equation g(ax+by)+g(cx+dy)=Ag(x)+Bg(y)on restricted domain. Namely, we show, under some weak natural...
متن کاملEmptiness of Linear Weak Alternating Automata
The automata-theoretic approach to model checking requires two basic ingredients: a translation from logic to automata, and an algorithm for checking language emptiness. LTL model checking has traditionally been based on (generalized) Büchi automata. Weak alternating automata provide an attractive alternative because there is an elegant and linear-time translation from LTL. However, due to thei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Math. Model. Algorithms in OR
دوره 12 شماره
صفحات -
تاریخ انتشار 2013